Importance of intrinsic and non-network contribution in PageRank centrality and its effect on PageRank localization
نویسنده
چکیده
PageRank centrality is used by Google for ranking web-pages to present search result for a user query. Here, we have shown that PageRank value of a vertex also depends on its intrinsic, nonnetwork contribution. If the intrinsic, non-network contributions of the vertices are proportional to their degrees or zeros, then their PageRank centralities become proportion to their degrees. Some simulations and empirical data are used to support our study. In addition, we have shown that localization of PageRank centrality depends upon the same intrinsic, non-network contribution.
منابع مشابه
Centrality metrics and localization in core-periphery networks
Two concepts of centrality have been defined in complex networks. The first considers the centrality of a node and many different metrics for it has been defined (e.g. eigenvector centrality, PageRank, non-backtracking centrality, etc). The second is related to a large scale organization of the network, the core-periphery structure, composed by a dense core plus an outlying and loosely-connecte...
متن کاملA PageRank-based preferential attachment model for the evolution of the World Wide Web
We propose a model of network growth aimed at mimicking the evolution of the World Wide Web. To this purpose, we take as a key quantity, in the network evolution, the centrality or importance of a vertex as measured by its PageRank. Using a preferential attachment rule and a rewiring procedure based on this quantity, we can reproduce most of the topological properties of
متن کاملPageRank for ranking authors in co-citation networks
This paper studies how varied damping factors in the PageRank algorithm influence the ranking of authors and proposes weighted PageRank algorithms. We selected the 108 most highly cited authors in the information retrieval (IR) area from the 1970s to 2008 to form the author co-citation network. We calculated the ranks of these 108 authors based on PageRank with the damping factor ranging from 0...
متن کاملNon-Conservative Diffusion and its Application to Social Network Analysis
Is the random walk appropriate for modeling and analyzing social processes? We argue that many interesting social phenomena, including epidemics and information diffusion, cannot be modeled as a random walk, but instead must be modeled as broadcast-based or non-conservative diffusion. To produce meaningful results, social network analysis algorithms have to take into account differences between...
متن کاملRethinking Centrality: The Role of Dynamical Processes in Social Network Analysis
Many popular measures used in social network analysis, including centrality, are based on the random walk. The random walk is a model of a stochastic process where a node interacts with one other node at a time. However, the random walk may not be appropriate for modeling social phenomena, including epidemics and information diffusion, in which one node may interact with many others at the same...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1609.00004 شماره
صفحات -
تاریخ انتشار 2016